Two-way automaton computationsBIRGET, J.-C.Informatique théorique et applications (Imprimé). 1990, Vol 24, Num 1, pp 47-66, issn 0988-3754, 20 p.Article

Alternating automata with start formulasMOSTOWSKI, A. W.Information processing letters. 1990, Vol 35, Num 6, pp 287-290, issn 0020-0190, 4 p.Article

A particular bit of universality: Scaling limits of some dependent percolation modelsCAMIA, Federico; NEWMAN, Charles M; SIDORAVICIUS, Vladas et al.Communications in mathematical physics. 2004, Vol 246, Num 2, pp 311-332, issn 0010-3616, 22 p.Article

Positive tree representations and applications to tree automataBOZAPALIDIS, S.Information and computation (Print). 1997, Vol 139, Num 2, pp 130-153, issn 0890-5401Article

The closure under division and a characterization of the recognizable Z-subsetsKOBAYASHI, N.Informatique théorique et applications (Imprimé). 1996, Vol 30, Num 3, pp 209-230, issn 0988-3754Article

Consciousness and attention : Psychological explanations of creativity and consciousnessDI NUOVO, S.Poznán studies in the philosophy of the sciences and the humanities. 1993, Vol 31, pp 325-336, issn 0303-8157Article

Note on node-rewriting graph grammarsKREOWSKI, H.-J; ROZNBERG, G.Information processing letters. 1984, Vol 18, Num 1, pp 21-24, issn 0020-0190Article

Modelling and synthesis of automata in HDLSCHMIELEWSKI, Slawomir; WEGRZYN, Marek.Proceedings of SPIE, the International Society for Optical Engineering. 2006, issn 0277-786X, isbn 0-8194-6431-7, vol1, 63470J.1-63470J.14Conference Paper

Construction et utilisation d'un modèle fonctionnel à un pas d'automate asynchroneBAJDA, V. D; MATROSOVA, A. YU.Avtomatika i telemehanika. 1984, Num 5, pp 117-124, issn 0005-2310Article

Sur les automates circulaires et la conjecture de ČernÝ = On circular automata and ČernÝ conjectureDUBUC, L.Informatique théorique et applications (Imprimé). 1998, Vol 32, Num 1-3, pp 21-34, issn 0988-3754Article

Another variation on the common subexpression problemNIVAT, M; PODELSKI, A.Discrete mathematics. 1993, Vol 114, Num 1-3, pp 379-401, issn 0012-365XConference Paper

A note on the reduction of two-way automata to one-way automataVARDI, M. Y.Information processing letters. 1989, Vol 30, Num 5, pp 261-264, issn 0020-0190Article

SOBRE MÁQUINAS E INSTRUMENTOS (I) : EL CUERPO DEL AUTÔMATA EN LA OBRA DE E.T.A. HOFFMANN = ABOUT MACHINES AND INSTRUMENTS (I) : THE BODY OF THE AUTOMATON IN THE WORK OF E.T.A. HOFFMANN = Sur les machines et les instruments : le corps de l'automate dans le travail d' E.T.A. HoffmanMONTIEL, Luis.Asclepio. 2008, Vol 60, Num 1, pp 151-176, issn 0210-4466, 26 p.Article

Sobre máquinas e instrumentos (II) : El mundo del ojo en la obra de E.T.A. Hoffmann = On machines and instruments (II) : The world of the eye in the work of E.T.A. Hoffmann = Sur les machines et les instruments (II) : le monde de l'oeil dans le travail de E.T.A HoffmannMONTIEL, Luis.Asclepio. 2008, Vol 60, Num 2, pp 207-232, issn 0210-4466, 26 p.Article

Introducing VAUCANSONLOMBARDY, Sylvain; REGIS-GIANAS, Yann; SAKAROVITCH, Jacques et al.Theoretical computer science. 2004, Vol 328, Num 1-2, pp 77-96, issn 0304-3975, 20 p.Conference Paper

The power of two-way deterministic checking stack automataENGELFRIET, J.Information and computation (Print). 1989, Vol 80, Num 2, pp 114-120, issn 0890-5401Article

A unified approach to control problems in discrete event processesBERGERON, A.Informatique théorique et applications (Imprimé). 1993, Vol 27, Num 6, pp 555-573, issn 0988-3754Article

The equivalence problem of multitape finite automataHARJU, T; KARHUMAKI, J.Theoretical computer science. 1991, Vol 78, Num 2, pp 347-355, issn 0304-3975, 9 p.Article

A survey of two-dimensional automata theoryINOUE, K; TAKANAMI, I.Information sciences. 1991, Vol 55, Num 1-3, pp 99-121, issn 0020-0255, 23 p.Article

Automate d'arbres infinis et choix borélienSIMONNET, P.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1993, Vol 316, Num 1, pp 97-100, issn 0764-4442Article

Filter automata admitting oscillating carrier wavesFUCHSSTEINER, B.Applied mathematics letters. 1991, Vol 4, Num 6, pp 23-26, issn 0893-9659Article

Surjective linear cellular automata over Z_mSATO, T.Information processing letters. 1998, Vol 66, Num 2, pp 101-104, issn 0020-0190Article

Rice's theorem for the limit sets of cellular automataKARI, J.Theoretical computer science. 1994, Vol 127, Num 2, pp 229-254, issn 0304-3975Article

Path-equivalent removals of ε-transitions in a genomic weighted finite automatonGIRAUD, Mathieu; VEBER, Philippe; LAVENIER, Dominique et al.Lecture notes in computer science. 2006, pp 23-33, issn 0302-9743, isbn 3-540-37213-X, 1Vol, 11 p.Conference Paper

The Borel hierarchy is infinite in the class of regular sets of treesSKURCZYNSKI, J.Theoretical computer science. 1993, Vol 112, Num 2, pp 413-418, issn 0304-3975Article